Topology-preserving perceptual segmentation using the Combinatorial Pyramid
نویسندگان
چکیده
Scene understanding and other high-level visual tasks usually rely on segmenting the captured images for dealing with a more efficient mid-level representation. Although this segmentation stage will consider topological constraints for the set of obtained regions (e.g., their internal connectivity), it is typical that the importance of preserving the topological relationships among regions will be not taken into account. Contrary to other similar approaches, this paper presents a bottom-up approach for perceptual segmentation of natural images which preserves the topology of the image. The segmentation algorithm consists of two consecutive stages: firstly, the input image is partitioned into a set of blobs of uniform colour (pre-segmentation stage) and then, using a more complex distance which integrates edge and region descriptors, these blobs are hierarchically merged (perceptual grouping). Both stages are addressed using the Combinatorial Pyramid, a hierarchical structure which can correctly encode relationships among image regions at upper levels. The performance of the proposed approach has been initially evaluated with respect to groundtruth segmentation data using the Berkeley Segmentation Dataset and Benchmark. Although additional descriptors must be added to deal with small regions and textured surfaces, experimental results reveal that the proposed perceptual grouping provides satisfactory scores. Keyworks topology-preserving image segmentation, perceptual grouping, irregular pyramids, combinatorial pyramids.
منابع مشابه
Hierarchies Relating Topology and Geometry
Cognitive Vision has to represent, reason and learn about objects in its environment it has to manipulate and react to. There are deformable objects like humans which cannot be described easily in simple geometric terms. In many cases they are composed of several pieces forming a “structured subset” of R or Z. We introduce the potential topological representations for structured objects: plane ...
متن کاملCombinatorial Pyramids and Discrete Geometry for Energy-Minimizing Segmentation
This paper defines the basis of a new hierarchical framework for segmentation algorithms based on energy minimization schemes. This new framework is based on two formal tools. First, a combinatorial pyramid encode efficiently a hierarchy of partitions. Secondly, discrete geometric estimators measure precisely some important geometric parameters of the regions. These measures combined with photo...
متن کاملCanonical Encoding of the Combinatorial Pyramid
This paper presents a novel framework to encode a combinatorial pyramid. A combinatorial pyramid is a hierarchy of successively reduced combinatorial maps. Important properties of the combinatorial pyramids such as topology preservation, the process global and local features within the same data structure, etc. made them useful for image processing and pattern recognition tasks. Their advantage...
متن کاملContains and inside relationships within combinatorial pyramids
Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular pyramid framework encode different types of relationships between regions. This paper compares different graph models used within the irregular pyramid frame...
متن کاملCombining regular decimation and dual graph contraction for hierarchical image segmentation
The Bounded Irregular Pyramid (BIP) is a hierarchical structure for image representation whose aim is to combine concepts from regular and irregular pyramids. The data structure is a combination of the simplest regular and irregular structures: the 2× 2/4 regular one and the simple graph representation. However, simple graphs only take into account adjacency relationships, being unable to corre...
متن کامل